HELLENISTIC GOLD COINS OF EPHESOS
نویسندگان
چکیده
منابع مشابه
Product Quality and the Law of Demand: An Example of early $2.5 Gold Coins
This article suggests that the Slutsky analysis should be extended so that quality is included in the consumer's utility function as a continuous variable. When quality is included in the consumer's utility function, the consumer is conceived to maximize his/her utility subject to his/her budget constraint by trading off quantity, quality, and price for various products in his market basket. Al...
متن کاملOverview of Colored Coins
Bitcoin ([3]) is the world’s first decentralized digital currency, allowing the easy storage and transfer of cryptographic tokens. It uses a peer-to-peer network to carry information, hashing as a synchronization signal to prevent double-spending, and a powerful scripting system to determine ownership of the tokens. There is a growing technology and business infrastructure supporting it. By the...
متن کاملMoving coins
We consider combinatorial and computational issues that are related to the problem of moving coins from one configuration to another. Coins are defined as non-overlapping discs, and moves are defined as collision free translations, all in the Euclidean plane. We obtain combinatorial bounds on the number of moves that are necessary and/or sufficient to move coins from one configuration to anothe...
متن کاملDetachable Electronic Coins
We propose a non-divisible electronic cash system that combines the restrictive blind signature technique and a batch signature scheme based upon the binary tree structure. Contemporary electronic cash solutions rely on the divisibility paradigm to achieve significant computational savings, and such techniques are considered to be the most efficient. We demonstrate an alternative approach that ...
متن کاملPrivate Coins versus Public Coins in Zero-Knowledge Proof Systems
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “fully black-box” privatecoin protocols based on one-way functions. More precisely, we show that only languages in BPP—where Sam is a “collision-finding” oracle in analogy with Simon (Eurocrypt’98) and Haitner et. al (FOCS’07...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Anadolu (Anatolia)
سال: 1978
ISSN: 0570-0116
DOI: 10.1501/andl_0000000209